Bounded Persistence Pathwidth
نویسندگان
چکیده
The role of graph width metrics, such as treewidth, pathwidth, and cliquewidth, is now seen as central in both algorithm design and the delineation of what is algorithmically possible. In this article we introduce a new, related, parameter for graphs, persistence. A path decomposition of width k, in which every vertex of the underlying graph belongs to at most l nodes of the path, has pathwidth k and persistence l, and a graph that admits such a decomposition has bounded persistence pathwidth. We believe that this natural notion truly captures the intuition behind the notion of pathwidth. We present some basic results regarding the general recognition of graphs having bounded persistence path decompositions.
منابع مشابه
Online Problems, Pathwidth, and Persistence
We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed input to instances having some form of bounded ...
متن کاملOnline promise problems with online width metrics
In this article we introduce a new program that applies ideas from parameterized complexity, and topological graph theory, to online problems. We focus on parameterized promise problems, where we are promised that the problem input obeys certain properties, or is presented in a certain fashion. We present some algorithmic ramifications of such problems in the online setting. We explore the effe...
متن کاملLight Spanners in Bounded Pathwidth Graphs
In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem) [8] and others [3]. We have developed an efficient algorithm in [9] for light spanners in bounded pathwidth graphs, based on an intermediate data structure called monotone tree. In this paper, we extended the results to include bounded catwidth graphs.
متن کاملCrossing Number for Graphs with Bounded~Pathwidth
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions,...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کامل